Generalized Multilinear Model for Dimensionality Reduction of Binary Tensors

نویسنده

  • Jakub Mažgut
چکیده

Generalized multilinear model for dimensionality reduction of binary tensors (GMM-DR-BT) is a technique for computing low-rank approximations of multi-dimensional data objects, tensors. The model exposes a latent structure that represents dominant trends in the binary tensorial data while retaining as much information as possible. Recently, there exist several models for computing the low-rank approximations of tensors but to the best of our knowledge at present there is no principled framework for binary tensors. Although the binary tensors occur in many real world applications such as gait recognition, document analysis or graph mining. In the GMM-DR-BT model formulation, to account for binary nature of the data, each tensor element is modeled by a Bernoulli noise distribution. To extract the dominant trends in the data, the natural parameters of the Bernoulli distributions are constrained by employing the Tucker model to lie in a sub-space spanned by a reduced set of basis (principal) tensors. Bernoulli distribution is a member of exponential family with helpful analytical properties that allow us to derive an iterative scheme for estimation of the basis tensors and other model parameters via maximum likelihood. Furthermore, we extended the fully unsupervised GMMDR-BT model to the semi-supervised setting by forcing the model to search for a natural parameter subspace that represents a user specified compromise between modelling the quality and the degree of class separation. ∗Recommended by thesis supervisor: Dr. Peter Tiňo. Defended at Faculty of Informatics and Information Technologies, Slovak University of Technology in Bratislava on August 30, 2012. c © Copyright 2012. All rights reserved. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from STU Press, Vazovova 5, 811 07 Bratislava, Slovakia. Mažgut, J. Generalized Multilinear Model for Dimensionality Reduction of Binary Tensors. Information Sciences and Technologies Bulletin of the ACM Slovakia, Vol. 4, No. 3 (2012) 35-46 We evaluated and compared the proposed GMM-DR-BT technique with existing real-valued and nonnegative tensor decomposition methods in several experiments involving variety of high-dimensional datasets. The results suggest that the GMM-DR-BT model is better suited for modeling binary tensors than its real-valued and nonnegative counterparts.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multilinear Subspace Analysis of Image Ensembles

Multilinear algebra, the algebra of higher-order tensors, offers a potent mathematical framework for analyzing ensembles of images resulting from the interaction of any number of underlying factors. We present a dimensionality reduction algorithm that enables subspace analysis within the multilinear framework. This N -mode orthogonal iteration algorithm is based on a tensor decomposition known ...

متن کامل

Dimensionality reduction in higher - order signal processing and rank - ( R 1 , R 2 , . . . , RN ) reduction in multilinear algebra

In this paper we review a multilinear generalization of the singular value decomposition and the best rank-(R1, R2, . . . , RN) approximation of higher-order tensors. We show that they are important tools for dimensionality reduction in higher-order signal processing. We discuss applications in independent component analysis, simultaneous matrix diagonalization and subspace variants of algorith...

متن کامل

Vectorial Dimension Reduction for Tensors Based on Bayesian Inference

Dimensionality reduction for high-order tensors is a challenging problem. In conventional approaches, higher order tensors are “vectorized” via Tucker decomposition to obtain lower order tensors. This will destroy the inherent high-order structures or resulting in undesired tensors, respectively. This paper introduces a probabilistic vectorial dimensionality reduction model for tensorial data. ...

متن کامل

Generalized Multi-Linear Principal Component Analysis of Binary Tensors

Current data processing tasks often involve manipulation of multi-dimensional objects tensors. In many real world applications such as gait recognition, document analysis or graph mining (with graphs represented by adjacency tensors), the tensors can be constrained to binary values only. To the best of our knowledge at present there is no principled systematic framework for decomposition of bin...

متن کامل

2D Dimensionality Reduction Methods without Loss

In this paper, several two-dimensional extensions of principal component analysis (PCA) and linear discriminant analysis (LDA) techniques has been applied in a lossless dimensionality reduction framework, for face recognition application. In this framework, the benefits of dimensionality reduction were used to improve the performance of its predictive model, which was a support vector machine (...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012